On the Regularity and Learnability of Ordered DAG Languages
نویسندگان
چکیده
Order-Preserving DAG Grammars (OPDGs) is a subclass of Hyper-Edge Replacement Grammars that can be parsed in polynomial time. Their associated class of languages is known as Ordered DAG Languages, and the graphs they generate are characterised by being acyclic, rooted, and having a natural order on their nodes. OPDGs are useful in natural-language processing to model abstract meaning representations. We state and prove a Myhill-Nerode theorem for ordered DAG languages, and translate it into a MAT-learning algorithm for the same class. The algorithm infers a minimal OPDG G for the target language in time polynomial in G and the samples provided by the MAT oracle.
منابع مشابه
$(m,n)$-Hyperideals in Ordered Semihypergroups
In this paper, first we introduce the notions of an $(m,n)$-hyperideal and a generalized $(m,n)$-hyperideal in an ordered semihypergroup, and then, some properties of these hyperideals are studied. Thereafter, we characterize $(m,n)$-regularity, $(m,0)$-regularity, and $(0,n)$-regularity of an ordered semihypergroup in terms of its $(m,n)$-hyperideals, $(m,0)$-hyperideals and $(0,n)$-hyperideal...
متن کاملcient Learning of Semi - structured Data from Queries
This paper studies the polynomial-time learnability of the classes of ordered gapped tree patterns (OGT) and ordered gapped forests (OGF) under the into-matching semantics in the query learning model of Angluin. The class OGT is a model of semi-structured database query languages, and a generalization of both the class of ordered/unordered tree pattern languages and the class of non-erasing reg...
متن کاملLearning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries
Formal Graph System (FGS) is a logic programming system that deals with term graph patterns instead of terms of first-order predicate logic. In this paper, based on FGS, we introduce primitive Formal Ordered Tree System (pFOTS) as formal system defining labeled ordered tree languages. A pFOTS is defined as a set of graph rewriting rules. The query learning model is an established learning model...
متن کاملUnderstanding Linguistic Evolution by Visualizing the Emergence of Topographic Mappings
We show how cultural selection for learnability during the process of linguistic evolution can be visualized using a simple iterated learning model. Computational models of linguistic evolution typically focus on the nature of, and conditions for, stable states. We take a novel approach and focus on understanding the process of linguistic evolution itself. What kind of evolutionary system is th...
متن کاملLearning Compound Order: Towards a Functional Explanation
This project investigates the problem of learning compound order, from an interdisciplinary perspective. Formal theories of linguistics have not addressed the question of why the constituents forming verbal compounds are ordered the way they are. Research in linguistic typology and language acquisition is critically examined, demonstrating the importance of the study of mental representation in...
متن کامل